A unified analysis for scheduling problems with variable processing times

<p style='text-indent:20px;'>This paper considers single-machine scheduling problems with variable processing times, in which the actual time of a job is function its additional resources, starting time, and position sequence. Four arising from two criteria (a cost total resource consumption cost) are investigated. Under linear convex functions, we provide unified approaches consequently prove that these four solvable polynomial time.</p>